Recurrences in Solving Triangular Systems of Linear Equations: Representation in the Structural Blanks Method

نویسنده

  • Vytautas Cyras
چکیده

In the paper we examine data dependencies in the algorithm of back substitution in the problem of solving triangular systems of linear equations. The aim of the paper is to illustrate the structural blanks (SB) notation in consistency proof of data dependencies in loop programs. Data dependency semantics of programs is introduced and investigated. The introduced notation constitutes the theoretical basis of data dependencies in SB. Two structural modules – a sequential S-module and a parallel one – are examined.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Efficient Numerical Algorithm For Solving Linear Differential Equations of Arbitrary Order And Coefficients

Referring to one of the recent works of the authors, presented in~cite{differentialbpf}, for numerical solution of linear differential equations, an alternative scheme is proposed in this article to considerably improve the accuracy and efficiency. For this purpose, triangular functions as a set of orthogonal functions are used. By using a special representation of the vector forms of triangula...

متن کامل

Numerical Solution of Second Kind Volterra and Fredholm Integral Equations Based on a Direct Method Via Triangular Functions

A numerical method for solving linear integral equations of the second kind is formulated. Based on a special representation of vector forms of triangular functions and the related operational matrix of integration, the integral equation reduces to a linear system of algebraic equations. Generation of this system needs no integration, so all calculations can easily be implemented. Numerical res...

متن کامل

SsT decomposition method for solving fully fuzzy linear systems

The SST decomposition method for solving system of linear equations make it possible to obtain the values of roots of the system with the specified accuracy as the limit of the sequence of some vectors. In this topic we are going to consider vectors as fuzzy vectors. We have considered a numerical example and tried to find out solution vector x in fuzzified form using method of SST decomposition.

متن کامل

Resolution of Fuzzy Complex Systems of Linear Equations Via Wu's Method

The aim of this paper is to present algebraic method which is called Wu's method to solving fuzzy complex systems of linear equations. Wu's method is used as a solution procedure for solving the crisp polynomial equations system. This algorithm leads to solving characteristic sets that are amenable to easy solution. To illustrate the easy application of the proposed method, numerical examples a...

متن کامل

A Fast and Accurate Expansion-Iterative Method for Solving Second Kind Volterra Integral Equations

This article proposes a fast and accurate expansion-iterative method for solving second kind linear Volterra integral equations. The method is based on a special representation of vector forms of triangular functions (TFs) and their operational matrix of integration. By using this approach, solving the integral equation reduces to solve a recurrence relation. The approximate solution of integra...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Informatica, Lith. Acad. Sci.

دوره 10  شماره 

صفحات  -

تاریخ انتشار 1999